硅和锗纳米线的原子排布和电荷分布的密度泛函紧束缚方法研究

低维硅锗材料是制备纳米电子器件的重要候选材料，是研发高效率、低能耗和超高速新一代纳米电子器件的基础材料之一，有着潜在的应用价值。采用密度泛函紧束缚方法分别对厚度相同、宽度在0.272 nm~0.554 nm之间的硅纳米线和宽度在0.283 nm~0.567 nm之间的锗纳米线的原子排布和电荷分布进行了计算研究。硅、锗纳米线宽度的改变使原子排布，纳米线的原子间键长和键角发生明显改变。纳米线表层结构的改变对各层内的电荷分布产生重要影响。纳米线中各原子的电荷转移量与该原子在表层内的位置相关。纳米线的尺寸和表层内原子排列结构对体系的稳定性产生重要影响。     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

正交匹配追踪算法的迭代残差重建方法

正交匹配追踪(Orthogonal Matching Pursuit, OMP)算法是一种重要的压缩感知重构算法. OMP算法在每次迭代中选择与当前残差最相关的原子. 针对每次迭代需要重新计算残差的问题, 本文考虑偶数次迭代下残差未知的情况. 首先, 研究了奇数次迭代的残差与下一次迭代的残差之间的关系, 得到了一种偶数次迭代时选择原子的标准. 然后, 引入一种回溯机制来处理前面所得的迭代结果, 这种机制通过剔除其中多余的原子来实现精确重建. 据此, 提出了可减少计算残差的改进型正交匹配追踪算法.     

Shotgun reconstruction in the hypercube

Mossel and Ross raised the question of when a random coloring of a graph can be reconstructed from local information, namely, the colorings (with multiplicity) of balls of given radius. In this article, we are concerned with random 2-colorings of the vertices of the -dimensional hypercube, or equivalently random Boolean functions. In the worst case, balls of diameter are required to reconstruct. However, the situation for random colorings is dramatically different: we show that almost every 2-coloring can be reconstructed from the multiset of colorings of balls of radius 2. Furthermore, we show that for , almost every -coloring can be reconstructed from the multiset of colorings of 1-balls.     

The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.     

A framework to perform high-order deconvolution for finite-volume method on simplicial meshes

In this article, a new framework to design high-order approximations in the context of node-centered finite volumes on simplicial meshes is proposed. The major novelty of this method is that it relies on very simple and compact differential operators, which is a critical point to achieve good performances in the High-performance computing context. This method is based on deconvolution between nodal and volume-average values, which can be conducted to any order. The interest of the new method is illustrated through three different applications: mesh-to-mesh interpolation, levelset curvature computation, and numerical scheme for convection. Higher order can also be achieved within the present framework by introducing high-rank tensors. Although these tensors feature much symmetries, their manipulation can quickly become an overwhelming task. For this reason and without loss of generality, the present articles are limited to third-order expansion. This method, although tightly connected to the k-exact schemes theory, does not rely on successive corrections: the high-order property is obtained in a single operation, which makes them more attractive in terms of performances.     

L1-type smoothness indicators based weighted essentially nonoscillatory scheme for Hamilton-Jacobi equations

This article presents an improved fifth-order finite difference weighted essentially nonoscillatory (WENO) scheme to solve Hamilton-Jacobi equations. A new type of nonlinear weights is introduced with the construction of local smoothness indicators on each local stencil that are measured with the help of generalized undivided differences in L¹-norm. A novel global smoothness measurement is also constructed with the help of local measurements from its linear combination. Numerical experiments are conducted in one- and two-dimensions to demonstrate the performance enhancement, resolution power, numerical accuracy for the proposed scheme, and compared it with the classical WENO scheme.     

A discontinuous Galerkin method for Stokes equation by divergence-free patch reconstruction

A discontinuous Galerkin method by patch reconstruction is proposed for Stokes flows. A locally divergence-free reconstruction space is employed as the approximation space, and the interior penalty method is adopted which imposes the normal component penalty terms to cancel out the pressure term. Consequently, the Stokes equation can be solved as an elliptic system instead of a saddle-point problem due to such weak form. The number of degree of freedoms of our method is the same as the number of elements in the mesh for different order of accuracy. The error estimations of the proposed method are given in a classical style, which are then verified by some numerical examples.     

Na原子链表面等离激元特性的含时密度泛函研究

本文用含时密度泛函理论研究了线性Na原子链的表面等离激元机理.主要在原子尺度下模拟计算了体系随着原子数增加及原子间距变化的集体激发过程.研究发现线性原子链有一个普遍的特性——存在一个纵模和两个横模.两个横模一般在实验上很难被观测到.纵模随着原子链长度增加,能量红移的同时,该纵模主峰的强度呈线性增长.随着原子个数的增加,端点模式(TE)开始蓝移,能量和偶极强度都逐渐趋向饱和.横模能量被劈裂的原因概括如下:(一)每个位置的电子受到的势不同,在两端的电子受到的势要比在中间的电子受到的势要高,因此两端的电荷积累也比中间多;(二)端点存在悬挂键,所以中间的电子-电子间相互作用与端点的不一样,这两方面又都与原子间距d有关.     

一种提高极值点处收敛精度的三阶WENO-Z格式

为了提高三阶WENO-Z格式在极值点处的计算精度，通过理论推导给出三阶WENO格式满足收敛精度的充分条件。采用泰勒级数展开的方式，推导给出所构造格式非线性权重的计算公式，并综合权衡计算精度和计算稳定性确定所构造格式的参数。通过两个典型的精度测试，验证了改进格式在光滑流场极值点区域逼近三阶精度。进一步选用激波与熵波相互作用和Richtmyer-Meshkov不稳定性等经典算例，证实了本文提出的改进格式WENO-PZ3相较其他格式（WENO-JS3和WENO-Z3）不仅具有较高的精度，而且降低了格式的耗散，提高了对流场结构的分辨率。